On the Algebraic Parameters of Convolutional Codes with Cyclic Structure
نویسندگان
چکیده
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [4] that only certain combinations of the algebraic parameters (field size, length, dimension, and Forney indices) can occur for such cyclic codes. We will investigate whether all these combinations can indeed be realized by a suitable cyclic code and, if so, how to construct such a code. A complete characterization and construction will be given for minimal cyclic codes. It is derived from a detailed investigation of the units in the skew-polynomial ring.
منابع مشابه
A matrix ring description for cyclic convolutional codes
In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe the algebraic parameters of the codes in a more accessible way. We show that the existence of such codes with given algebraic parameters can be reduced to the...
متن کاملAlgebraic decoding for doubly cyclic convolutional codes
An iterative decoding algorithm for convolutional codes is presented. It successively processes N consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be corrected. The algorithm can be efficiently used on a particular class of convolutional codes, known as doubly cyclic convolutional codes. Due to their highly a...
متن کاملConstructions of MDS-convolutional codes
Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. ...
متن کاملToward an Algebraic Theory for Turbo Codes
Instead of a random interleaver, an algebraic interleaver interconnecting two simple convolutional codes with feedback encoders forms an algebraic quasi-cyclic code. An (nC , k) convolutional code in tailbiting form becomes a quasi-cyclic (QC) linear code of length LnC for some L = Mn. Interleavers with a period M connect two such codes to produce a QC turbo code. The QC turbo codes check equat...
متن کاملOn the Parameters of Convolutional Codes with Cyclic Structure
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the parameters (field size, length, dimension, and Forney indices) can occur for cyclic codes. We will investigate whether all these combinations can indeed be realized ...
متن کامل